Flow-sensitive type recovery in linear-log time
نویسندگان
چکیده
منابع مشابه
Flow-Sensitive Sub-Zero Control-Flow Analysis in Linear-Log Time
Traditional control-flow analysis (CFA) for higher-order languages is too expensive to be used as an every-day analysis in an otherwise fast compiler that is often called upon to compile large programs. It is even more expensive when flow sensitivity is added to handle optimizations like type recovery. In particular, the fastest known algorithms for 0CFA, the least expensive of the popular kCFA...
متن کاملFlow-Sensitive Loop-Variant Variable Classification in Linear Time
This paper presents an efficient algorithm for classifying generalized induction variables and more complicated flow-sensitive loopvariant variables that have arbitrary conditional update patterns along multiple paths in a loop nest. Variables are recognized and translated into closed-form functions, such as linear, polynomial, geometric, wraparound, periodic, and mixer functions. The remaining...
متن کاملFlow-sensitive Type Analysis for C++ Flow-sensitive Type Analysis for C++
LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and spe...
متن کاملOptimizing Integer Sorting in O(n log log n) Expected Time in Linear Space
The traditional algorithms for integer sorting give a bound of O(n log n) expected time without randomization and O(n) with randomization. Recent researches have optimized lower bound for deterministic algorithms for integer sorting [4, 5, 7]. We present a fast deterministic algorithm for integer sorting in linear space. The algorithm discussed in this paper sorts n integers in the range {0, 1,...
متن کاملMining Time-Sensitive Queries and their Sensitivities from Query Log
In this paper, we present a new concept called time-sensitive query. A query is time-sensitive if the set of relevant pages changes when the query is expanded with different temporal terms. Knowing which queries are time-sensitive and what sensitivities they have can be very useful in automatic query expansion for improving search effectiveness and user experience. Existing methods related to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2011
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2076021.2048105